On the poset of partitions of an integer
نویسنده
چکیده
We study the posets (partially ordered sets) P, of partitions of an integer n, ordered by refinement, as defined by G. Birkhoff, “Lattice Theory” (3rd ed.) Colloq. Pub]. Vol. 25, 1967, Amer. Math. Sot. Providence. R.I. In particular we disprove the conjecture that the posets P,, are Cohen-Macaulay for all n. and show that even the Mobius function on the intervals does not alternate in sign in general. (’ 1986
منابع مشابه
An Upper Bound for the Size of the Largest Antichain in the Poset of Partitions of an Integer
Let P i n be the poset of partitions of an integer n, ordered by re-nement. Let b(P i n) be the largest size of a level and d(P i n) be the largest size of an antichain of P i n. We prove that d(P i n) b(P i n) e + o(1) as n ! 1: The denominator is determined asymptotically. In addition, we show that the incidence matrices in the lower half of P i n have full rank, and we prove a tight upper bo...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملImproved Univariate Microaggregation for Integer Values
Privacy issues during data publishing is an increasing concern of involved entities. The problem is addressed in the field of statistical disclosure control with the aim of producing protected datasets that are also useful for interested end users such as government agencies and research communities. The problem of producing useful protected datasets is addressed in multiple computational priva...
متن کاملEdges in the poset of partitions of an integer
The edges in the Hasse diagram of the partitions of an integer ordered by reverse refinement are studied. A recursive count of the edges between ranks is developed. Let P, be the poset of partitions of n, ordered by refinement. It contains p(n; n-t) elements of rank t, where p(n; k) denotes the number of partitions of n into h-parts, p(n) will denote the number of partitions of n. The number NE...
متن کاملDecomposition Numbers for Finite Coxeter Groups and Generalised Non-crossing Partitions
Given a finite irreducible Coxeter group W , a positive integer d, and types T1, T2, . . . , Td (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions c = σ1σ2 · · ·σd of a Coxeter element c of W , such that σi is a Coxeter element in a subgroup of type Ti in W , i = 1, 2, . . . , d, and such that the factorisation is “minimal” in the sense that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 27 شماره
صفحات -
تاریخ انتشار 1986